A method for inferring context-free grammars

Incrementally Inferring Context-Free Grammars for Domain-Specific Languages

Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to the programming language problem domain has been limited. We propose a new application area for grammar inference which intends to make domain-specific language development easier and finds a second application in ren...

A Regularity Measure for Context Free Grammars

Parikh’s theorem states that every Context Free Language (CFL) has the same Parikh image as that of a regular language. A finite state automaton accepting such a regular language is called a Parikh-equivalent automaton. In the worst case, the number of states in any non-deterministic Parikh-equivalent automaton is exponentially large in the size of the Context Free Grammar (CFG). We associate a...

A Parser for Harmoni Context-Free Grammars

A Parser for Harmonic Context-Free Grammars

Harmonic Grammar is a connectionist-derived grammar formalism, of which Optimality Theory is a kind of limiting case. Harmonic Grammar is expressive enough to specify the trees that are correct parses on a given contextfree grammar. Here, we show how to construct a connectionist parsing network which finds correct parses given a sentence, of if none exist, signals a rejection. Finally, a brief ...

Modularized Context-Free Grammars

Given two context-free grammars (CFGs), G 1 and G 2 , the language generated by the union of the grammars is not the union of the languages generated by each grammar: L(G 1 G 2) 6 = L(G 1) L(G 2). In order to account for mod-ularity of grammars, another way of deening the meaning of grammars is needed. This paper adapts results from the semantics of logic programming languages to CFGs. We discu...